Preserving Partial Solutions While Relaxing Constraint Networks

نویسندگان

  • Éric Grégoire
  • Jean-Marie Lagniez
  • Bertrand Mazure
چکیده

This paper is about transforming constraint networks to accommodate additional constraints in specific ways. The focus is on two intertwined issues. First, we investigate how partial solutions to an initial network can be preserved from the potential impact of additional constraints. Second, we study how more permissive constraints, which are intended to enlarge the set of solutions, can be accommodated in a constraint network. These two problems are studied in the general case and the light is shed on their relationship. A case study is then investigated where a more permissive additional constraint is taken into account through a form of network relaxation, while some previous partial solutions are preserved at the same time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient automated schematic map drawing using multiobjective mixed integer programming

We present an efficient multiobjective mixed binary linear program that automates schematic mapping for network visualization and navigation. Schematic mapping has broad applications in representing transit networks, circuits, disease pathways, project tasks, organograms, and taxonomies. Good schematic maps employ distortion while preserving topology to facilitate access to physical or virtual ...

متن کامل

A centralized privacy-preserving framework for online social networks

There are some critical privacy concerns in the current online social networks (OSNs). Users' information is disclosed to different entities that they were not supposed to access. Furthermore, the notion of friendship is inadequate in OSNs since the degree of social relationships between users dynamically changes over the time. Additionally, users may define similar privacy settings for their f...

متن کامل

On two perspectives in decomposing constraint systems Equivalences and computational properties

Decomposition is a technique to split a problem in a number of parts such that some global property of the problem can be obtained or preserved by concurrent processing of these parts. In artificial intelligence applications, as for example in scheduling, almost always the aim of decomposition is to find solutions to a (global) constraint system by distributed computations. Decomposition should...

متن کامل

CONSTRAINT Networks

1 Introduction Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satised. A variety of techniques have been developed for nding partial or complete solutions for dierent kinds of constraint expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth...

متن کامل

Constraint Networks 1

1 Introduction Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satised. A variety of techniques have been developed for nding partial or complete solutions for dierent kinds of constraint expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013